Locally bounded coverings and factorial properties of graphs
نویسندگان
چکیده
منابع مشابه
Factorial properties of graphs
We explore an operation on graphs that is analogous to the factorial of a positive integer. We develop formulas for the factorials of complete graphs, odd cycles and complete bipartite graphs, and we prove some properties of the factorial operation. We conclude with a list of open questions. This paper explores some properties of a factorial operation that associates to each graph G a graph G! ...
متن کاملProperties of random coverings of graphs
In the thesis we study selected properties of random coverings of graphs introduced by Amit and Linial in 2002. A random n-covering of a graph G, denoted by G̃, is obtained by replacing each vertex v of G by an n-element set G̃v and then choosing, independently for every edge e = {x, y} ∈ E(G), uniformly at random a perfect matching between G̃x and G̃y. The first problem we consider is the typical ...
متن کاملAlgorithms for Graphs of (Locally) Bounded Treewidth
Many real-life problems can be modeled by graph-theoretic problems. These graph problems are usually NP-hard and hence there is no efficient algorithm for solving them, unless P= NP. One way to overcome this hardness is to solve the problems when restricted to special graphs. Trees are one kind of graph for which several NP-complete problems can be solved in polynomial time. Graphs of bounded t...
متن کاملOn factorial properties of chordal bipartite graphs
For a graph property X, let Xn be the number of graphs with vertex set {1, . . . , n} having property X, also known as the speed of X. A property X is called factorial if X is hereditary (i.e. closed under taking induced subgraphs) and n1 ≤ Xn ≤ n2 for some positive constants c1 and c2. Hereditary properties with the speed slower than factorial are surprisingly well structured. The situation wi...
متن کاملStructure And Properties Of Locally Outerplanar Graphs
This paper studies convex geometric graphs in which no path of length 3 self-intersects. A main result gives a decomposition of such graphs into induced outerplanar graph drawings. The resulting structure theorem is then used to compute a sharp, linear upper bound on the size of the edge set in terms of the number of vertices and the number and type of graphs in the decomposition. The paper als...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2012
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.10.006